Constructing supersingular elliptic curves with a given endomorphism ring
نویسندگان
چکیده
منابع مشابه
9.1 Elliptic Curves with a given Endomorphism Ring
and we know that this ring is isomorphic to Z or an order O in an imaginary quadratic field K; in fact, the ring on the right is equal to Z or O (viewed as a subring of C).1 To simplify the discussion, we shall treat the isomorphism in (1) as an equality and view elements of End(EL) as elements of Z or O. How might we construct an elliptic curve with endomorphism ring O? An obvious way is to us...
متن کاملConstructing Supersingular Elliptic Curves
We give an algorithm that constructs, on input of a prime power q and an integer t, a supersingular elliptic curve over Fq with trace of Frobenius t in case such a curve exists. If GRH holds true, the expected run time of our algorithm is e O((log q)). We illustrate the algorithm by showing how to construct supersingular curves of prime order. Such curves can readily be used for pairing based c...
متن کاملConstructing Elliptic Curves with a Given Number of Points
We describe how the theory of complex multiplication can be used to construct elliptic curves over a finite field with a given number of rational points and illustrate how this method can be applied to primality testing.
متن کاملOn the Hardness of Computing Endomorphism Rings of Supersingular Elliptic Curves
Cryptosystems based on supersingular isogenies have been proposed recently for use in post-quantum cryptography. Three problems have emerged related to their hardness: computing an isogeny between two curves, computing the endomorphism ring of a curve, and computing a maximal order associated to it. While some of these problems are believed to be polynomial-time equivalent based on heuristics, ...
متن کاملConstructing elliptic curves with a given number of points over a finite field
In using elliptic curves for cryptography, one often needs to construct elliptic curves with a given or known number of points over a given finite field. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication to construct such curves. One of the steps in this method is the calculation of the Hilbert class polynomial HD(X) modulo some inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2014
ISSN: 1461-1570
DOI: 10.1112/s1461157014000254